TSTP Solution File: SET014^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET014^4 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:17:20 EDT 2024
% Result : Theorem 0.16s 0.42s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of formulae : 19 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 28 ( 4 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 66 ( 7 ~; 9 |; 5 &; 38 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 25 ( 10 ^ 15 !; 0 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_27,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
subset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_36,type,
epred1_0: $i > $o ).
thf(decl_37,type,
epred2_0: $i > $o ).
thf(decl_38,type,
epred3_0: $i > $o ).
thf(decl_39,type,
esk1_0: $i ).
thf(union,axiom,
( union
= ( ^ [X5: $i > $o,X6: $i > $o,X4: $i] :
( ( X5 @ X4 )
| ( X6 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JHrQtDudL1/E---3.1_13202.p',union) ).
thf(subset,axiom,
( subset
= ( ^ [X16: $i > $o,X17: $i > $o] :
! [X4: $i] :
( ( X16 @ X4 )
=> ( X17 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JHrQtDudL1/E---3.1_13202.p',subset) ).
thf(thm,conjecture,
! [X22: $i > $o,X23: $i > $o,X24: $i > $o] :
( ( ( subset @ X22 @ X24 )
& ( subset @ X23 @ X24 ) )
=> ( subset @ ( union @ X22 @ X23 ) @ X24 ) ),
file('/export/starexec/sandbox/tmp/tmp.JHrQtDudL1/E---3.1_13202.p',thm) ).
thf(c_0_3,plain,
( union
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[union]) ).
thf(c_0_4,plain,
( subset
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[subset]) ).
thf(c_0_5,negated_conjecture,
~ ! [X22: $i > $o,X23: $i > $o,X24: $i > $o] :
( ( ! [X28: $i] :
( ( X22 @ X28 )
=> ( X24 @ X28 ) )
& ! [X29: $i] :
( ( X23 @ X29 )
=> ( X24 @ X29 ) ) )
=> ! [X30: $i] :
( ( ( X22 @ X30 )
| ( X23 @ X30 ) )
=> ( X24 @ X30 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_3]),c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X34: $i,X35: $i] :
( ( ~ ( epred1_0 @ X34 )
| ( epred3_0 @ X34 ) )
& ( ~ ( epred2_0 @ X35 )
| ( epred3_0 @ X35 ) )
& ( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ~ ( epred3_0 @ esk1_0 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i] :
( ( epred3_0 @ X1 )
| ~ ( epred2_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_8,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
~ ( epred3_0 @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,negated_conjecture,
! [X1: $i] :
( ( epred3_0 @ X1 )
| ~ ( epred1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_11,negated_conjecture,
epred1_0 @ esk1_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
thf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SET014^4 : TPTP v8.1.2. Released v3.6.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n017.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 09:44:06 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.16/0.41 Running higher-order theorem proving
% 0.16/0.41 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.JHrQtDudL1/E---3.1_13202.p
% 0.16/0.42 # Version: 3.1.0-ho
% 0.16/0.42 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting new_ho_9 with 1500s (5) cores
% 0.16/0.42 # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.42 # Starting sh1l with 300s (1) cores
% 0.16/0.42 # Starting post_as_ho10 with 300s (1) cores
% 0.16/0.42 # post_as_ho1 with pid 13281 completed with status 0
% 0.16/0.42 # Result found by post_as_ho1
% 0.16/0.42 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting new_ho_9 with 1500s (5) cores
% 0.16/0.42 # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.42 # No SInE strategy applied
% 0.16/0.42 # Search class: HGUNF-FFSF00-SHSSMFNN
% 0.16/0.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.42 # new_ho_10 with pid 13287 completed with status 0
% 0.16/0.42 # Result found by new_ho_10
% 0.16/0.42 # Preprocessing class: HSSSSMSSMLSNHSN.
% 0.16/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.42 # Starting new_ho_9 with 1500s (5) cores
% 0.16/0.42 # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.42 # No SInE strategy applied
% 0.16/0.42 # Search class: HGUNF-FFSF00-SHSSMFNN
% 0.16/0.42 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.42 # Starting new_ho_10 with 163s (1) cores
% 0.16/0.42 # Preprocessing time : 0.001 s
% 0.16/0.42 # Presaturation interreduction done
% 0.16/0.42
% 0.16/0.42 # Proof found!
% 0.16/0.42 # SZS status Theorem
% 0.16/0.42 # SZS output start CNFRefutation
% See solution above
% 0.16/0.42 # Parsed axioms : 29
% 0.16/0.42 # Removed by relevancy pruning/SinE : 0
% 0.16/0.42 # Initial clauses : 18
% 0.16/0.42 # Removed in clause preprocessing : 14
% 0.16/0.42 # Initial clauses in saturation : 4
% 0.16/0.42 # Processed clauses : 9
% 0.16/0.42 # ...of these trivial : 0
% 0.16/0.42 # ...subsumed : 0
% 0.16/0.42 # ...remaining for further processing : 9
% 0.16/0.42 # Other redundant clauses eliminated : 0
% 0.16/0.42 # Clauses deleted for lack of memory : 0
% 0.16/0.42 # Backward-subsumed : 0
% 0.16/0.42 # Backward-rewritten : 1
% 0.16/0.42 # Generated clauses : 2
% 0.16/0.42 # ...of the previous two non-redundant : 1
% 0.16/0.42 # ...aggressively subsumed : 0
% 0.16/0.42 # Contextual simplify-reflections : 0
% 0.16/0.42 # Paramodulations : 2
% 0.16/0.42 # Factorizations : 0
% 0.16/0.42 # NegExts : 0
% 0.16/0.42 # Equation resolutions : 0
% 0.16/0.42 # Disequality decompositions : 0
% 0.16/0.42 # Total rewrite steps : 1
% 0.16/0.42 # ...of those cached : 0
% 0.16/0.42 # Propositional unsat checks : 0
% 0.16/0.42 # Propositional check models : 0
% 0.16/0.42 # Propositional check unsatisfiable : 0
% 0.16/0.42 # Propositional clauses : 0
% 0.16/0.42 # Propositional clauses after purity: 0
% 0.16/0.42 # Propositional unsat core size : 0
% 0.16/0.42 # Propositional preprocessing time : 0.000
% 0.16/0.42 # Propositional encoding time : 0.000
% 0.16/0.42 # Propositional solver time : 0.000
% 0.16/0.42 # Success case prop preproc time : 0.000
% 0.16/0.42 # Success case prop encoding time : 0.000
% 0.16/0.42 # Success case prop solver time : 0.000
% 0.16/0.42 # Current number of processed clauses : 4
% 0.16/0.42 # Positive orientable unit clauses : 1
% 0.16/0.42 # Positive unorientable unit clauses: 0
% 0.16/0.42 # Negative unit clauses : 1
% 0.16/0.42 # Non-unit-clauses : 2
% 0.16/0.42 # Current number of unprocessed clauses: 0
% 0.16/0.42 # ...number of literals in the above : 0
% 0.16/0.42 # Current number of archived formulas : 0
% 0.16/0.42 # Current number of archived clauses : 5
% 0.16/0.42 # Clause-clause subsumption calls (NU) : 0
% 0.16/0.42 # Rec. Clause-clause subsumption calls : 0
% 0.16/0.42 # Non-unit clause-clause subsumptions : 0
% 0.16/0.42 # Unit Clause-clause subsumption calls : 0
% 0.16/0.42 # Rewrite failures with RHS unbound : 0
% 0.16/0.42 # BW rewrite match attempts : 1
% 0.16/0.42 # BW rewrite match successes : 1
% 0.16/0.42 # Condensation attempts : 9
% 0.16/0.42 # Condensation successes : 0
% 0.16/0.42 # Termbank termtop insertions : 1001
% 0.16/0.42 # Search garbage collected termcells : 233
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.002 s
% 0.16/0.42 # System time : 0.002 s
% 0.16/0.42 # Total time : 0.004 s
% 0.16/0.42 # Maximum resident set size: 1780 pages
% 0.16/0.42
% 0.16/0.42 # -------------------------------------------------
% 0.16/0.42 # User time : 0.003 s
% 0.16/0.42 # System time : 0.004 s
% 0.16/0.42 # Total time : 0.007 s
% 0.16/0.42 # Maximum resident set size: 1748 pages
% 0.16/0.42 % E---3.1 exiting
% 0.16/0.42 % E exiting
%------------------------------------------------------------------------------